Generalized Poststratification and Importance Sampling for Subsampled Markov Chain Monte Carlo Estimation

نویسندگان

  • Subharup GUHA
  • Steven N. MACEACHERN
چکیده

Benchmark estimation is motivated by the goal of producing an approximation to a posterior distribution that is better than the empirical distribution function. This is accomplished by incorporating additional information into the construction of the approximation. We focus here on generalized poststratification, the most successful implementation of benchmark estimation in our experience. We develop generalized poststratification for settings where the source of the simulation differs from the posterior that is to be approximated. This allows us to use the techniques in settings where it is advantageous to draw from a distribution different than the posterior, whether for exploration of the data and/or model, for algorithmic simplicity, for improved convergence of the simulation, or for improved estimation of selected features of the posterior. We develop an asymptotic (in simulation size) theory for the estimators, providing conditions under which central limit theorems hold. The central limit theorems apply both to an importance sampling context and to direct sampling from the posterior distribution. The asymptotic results, coupled with large-sample (size of data) approximation results provide guidance on how to implement generalized poststratification. The theoretical results also explain the gains associated with generalized poststratification and the empirically observed robustness to cutpoints for the strata. We note that the results apply well beyond the setting of Markov chain Monte Carlo simulation. The technique is illustrated with an infinite-dimensional semiparametric Bayesian regression model and a low-dimensional, overdispersed hierarchical Bayesian model. In both cases, the technique shows substantial benefits.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bayesian Estimation of Generalized Exponential Distribution under Progressive First Failure Censored Sample

In this paper, we consider the maximum likelihood (ML) and Bayes estimation of the parameters of the generalized exponential distribution based on progressive first failure censored samples. We also consider the problem of predicting an independent future order statistics from the same distribution. However, since Bayes estimator do not exist in an explicit form for the parameters, Markov Chain...

متن کامل

Markov chain importance sampling with applications to rare event probability estimation

We present a versatile Monte Carlo method for estimating multidimensional integrals, with applications to rare-event probability estimation. The method fuses two distinct and popular Monte Carlo simulation methods — Markov chain Monte Carlo and importance sampling — into a single algorithm. We show that for some illustrative and applied numerical examples the proposed Markov Chain importance sa...

متن کامل

Markov Chain Monte Carlo Sampling for Evaluating Multidimensional Integrals with Application to Bayesian Computation

Recently, Markov chain Monte Carlo (MCMC) sampling methods have become widely used for determining properties of a posterior distribution. Alternative to the Gibbs sampler, we elaborate on the Hit-and-Run sampler and its generalization, a black-box sampling scheme, to generate a time-reversible Markov chain from a posterior distribution. The proof of convergence and its applications to Bayesian...

متن کامل

Implementations of the Monte Carlo EM Algorithm

The Monte Carlo EM (MCEM) algorithm is a modification of the EM algorithm where the expectation in the E-step is computed numerically through Monte Carlo simulations. The most flexible and generally applicable approach to obtaining a Monte Carlo sample in each iteration of an MCEM algorithm is through Markov chain Monte Carlo (MCMC) routines such as the Gibbs and Metropolis–Hastings samplers. A...

متن کامل

A Stochastic algorithm to solve multiple dimensional Fredholm integral equations of the second kind

In the present work‎, ‎a new stochastic algorithm is proposed to solve multiple dimensional Fredholm integral equations of the second kind‎. ‎The solution of the‎ integral equation is described by the Neumann series expansion‎. ‎Each term of this expansion can be considered as an expectation which is approximated by a continuous Markov chain Monte Carlo method‎. ‎An algorithm is proposed to sim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006